An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
نویسندگان
چکیده
Article history: Received 24 March 2013 Received in revised form 4 November 2013 Accepted 24 January 2014 Available online 18 February 2014
منابع مشابه
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring inclusive constraints
In this paper, we consider a generalized longest common subsequence problem with multiple substring inclusive constraints. For the two input sequences X and Y of lengths n and m, and a set of d constraints P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y including each of constraint string in P as a substring and the length of Z is maximized. A ne...
متن کاملAn Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains
In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences X and Y of lengths n and m, and a set of d constrains P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y excluding each of constrain string in P as a substring and the length of Z is maximized. The pro...
متن کاملA Polynomial Time Algorithm for a Generalized Longest Common Subsequence Problem
In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusive constraints. For the two input sequences X and Y of lengths n and m, and a set of d constraints P = {P1, · · · , Pd} of total length r, the problem is to find a common subsequence Z of X and Y excluding each of constraint string in P as a substring and the length of Z is maximized. A ve...
متن کاملAn Efficient Dynamic Programming Algorithm for a New Generalized LCS Problem
In this paper, we consider a generalized longest common subsequence problem, in which a constraining sequence of length s must be included as a substring and the other constraining sequence of length t must be included as a subsequence of two main sequences and the length of the result must be maximal. For the two input sequences X and Y of lengths n and m, and the given two constraining sequen...
متن کاملA Simple Polynomial Time Algorithm for the Generalized LCS Problem with Multiple Substring Exclusive Constraints
In this paper, we present a simple polynomial time algorithm for a generalized longest common subsequence problem with multiple substring exclusion constraints. Given two sequences X and Y of lengths m and n, respectively, and a set of constraint strings P of total length r, we are to find a common subsequence z of X and Y which excludes each of strings in P as a substring and the length of z i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Discrete Algorithms
دوره 26 شماره
صفحات -
تاریخ انتشار 2014